Superposed and per - process analysis in ∑ D - BMAP / D / 1 / K queuing system

The focus of our paper is on superposed and perprocess performance evaluation of network node in terms of losses, delays and jitter. We consider the case of discrete-time queuing system, which is fed by finite superposition of discretetime batch Markovian arrival processes (D-BMAPs), and denoted in Kendall’s notation by P D-BMAP/D/1/K. Given such system we obtain probability distribution functions of number of lost packets, delay of arbitrary packet and jitter for both superposed and single arrival processes. These performance parameters describe the quality of service (QoS) provided by the network node to aggregated variable bit rate (VBR) traffic stream and particular VBR traffic stream in presence of background VBR traffic with the same priority. It should be noted that analytical solution of P D-BMAP/D/1/K have received a little attention in recent literature. Our purpose is to extend those works to the general case of D-BMAP arrival process and give results applicable to all particular instances of D-BMAP.